شناسایی ابررویه های فضافرم های استاندارد تعریف شده بوسیله فروبری های طولپایی x:m_p^n -----> ilde{m}_q^{n+1}(c که l_kx=ax+b و 0leq p leq q leq 1.

On the matrix equations U_iXV_j W_{i j} for 1 \leq i; j \leq k with i +j \leq k

An $S$-adic characterization of minimal subshifts with first difference of complexity $1 \leq p(n+1) - p(n) \leq 2$

In [Ergodic Theory Dynam. System, 16 (1996) 663–682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is S-adic with Card(S) ≤ 327. In this paper, we improve this result by giving an S-adic charaterization of these subshifts with a set S of 5 morphisms, solving by this way the S-adic conjecture for this particular case.

Recovery analysis for weighted mixed $\ell_2/\ell_p$ minimization with $0<p\leq 1$

We study the recovery conditions of weighted mixed l2/lp (0 < p ≤ 1) minimization for block sparse signal reconstruction from compressed measurements when partial block support information is available. We show that the block p-restricted isometry property (RIP) can ensure the robust recovery. Moreover, we present the sufficient and necessary condition for the recovery by using weighted block p...

An unbiased population-based search for the geometry optimization of Lennard-Jones clusters: 2 leq N leq 372

This article presents the results obtained using an unbiased Population Based Search (PBS) for optimizing Lennard-Jones clusters. PBS is able to repeatedly obtain all putative global minima, for Lennard-Jones clusters in the range 2 < or = N < or = 372, as reported in the Cambridge Cluster Database. The PBS algorithm incorporates and extends key techniques that have been developed in other Lenn...

Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1

A cyclic consecutive-k-out-of-n: G system consists of n components lying on a cycle. Those components are exchangeable but may have different working probabilities. The system works if and only if there are k consecutive components at work. What is the optimal assignment of components for maximizing the reliability of the system? Does the optimal assignment depend on the working probability val...

ابررویه های وینگارتن خطی در فضافرم های ریمانی

دراین پایان نامه، هدف تمرکز بر روی ابررویه های خاص با نام وینگارتن خطی در فضافرم های مختلف است. برخی نتایج مهم این ابررویه ها با انحنای میانگین ثابت و انحنای عددی ثابت به دست می آیند. درجهت دسته بندی این ابررویه ها، قضیه ای به نام قضیه ی ماکزیمم ضعیف مطرح می شود. برای ابرررویه های کروی واحد که انحنای مقطعی نامنفی دارند و انحنای عددی نرمال شده ی آن ها ثابت، بزرگتر یا مساوی یک است، دو امکان وجود...